Detection of Precise C / C + + Memory Leakage by diagnosing Heap dumps using Inter procedural Flow Analysis statistics
نویسنده
چکیده
Memory leak is a time consuming bug often created by C++ developers. Detection of memory leaks is often tedious. Things get worst if the code is not written by you, or if the code base is quite huge. The most difficult coding bugs such as Memory Corruption, reading uninitialized memory, using freed memory, are challenging in recognizing and fixing due to the delay and non-determinism linking the error. Detecting memory leaks is challenging because real-world applications are built on multiple layers of software frameworks, making it difficult for a developer to know whether observed references to objects are legitimate or the cause of a leak. Our aim is to build a fast and feature rich c Heap Analyzer that helps the user in finding memory leaks and to reduce memory consumption. By using the Heap analyzer. Productive heap dumps with hundreds of millions of objects and the retained sizes of objects can be calculated quickly [2]. This analyzer also prevents the garbage collector from collecting objects, run a report to automatically extract heap leak suspects. The Heap Analyzer allows the users in finding the possible heap leak areas in various C/C++ applications through its Context flow analysis and heap dump analysis. Our approach identifies not just leaking candidates and their structure, but also provides aggregate information about the access path to the leaks
منابع مشابه
Static Analysis of Accessed Regions in Recursive Data Structures
This paper presents an inter-procedural heap analysis that computes information about how programs access regions within recursive data structures, such as sublists within lists or subtrees within trees. The analysis is able to accurately compute heap access information for statements and procedures in recursive programs with destructive updates. We formulate our algorithm as a dataflow analysi...
متن کاملEffects of Pregnant Leach Solution Temperature on the Permeability of Gravelly Drainage Layer of Heap Leaching Structures
In copper heap leaching structures, the ore is leached by an acidic solution. After dissolving the ore mineral, the heap is drained off in the acidic solution using a drainage system (consisting of a network of perforated polyethylene pipes and gravelly drainage layers) and is, then, transferred to the leaching plant for copper extraction where the copper is extracted and the remaining solution...
متن کاملUsing Inter-Procedural Side-Effect Information in JIT Optimizations
Inter-procedural analyses such as side-effect analysis can provide information useful for performing aggressive optimizations. We present a study of whether side-effect information improves performance in just-in-time (JIT) compilers, and if so, what level of analysis precision is needed. We used SPARK, the inter-procedural analysis component of the SOOT Java analysis and optimization framework...
متن کاملOn the Impact of Naming Methods for Heap-Oriented Pointers in C Programs
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is critical for compilers to generate high performance code. However, most previous research on pointer analysis mostly focuses on pointers pointing to global or local variables. In this paper, we study points-to analysis o...
متن کاملAn Empirical Study on the Granularity of Pointer Analysis in C Programs
Pointer analysis plays a critical role in modern C compilers because of the frequent appearances of pointer expressions. It is even more important for data dependence analysis, which is essential in exploiting parallelism, because complex data structures such as arrays are often accessed through pointers in C. One of the important aspects of pointer analysis methods is their granularity, the wa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013